the inflation $g_{i}$ of a graph $g$ with $n(g)$ vertices and $m(g)$ edges is obtained from $g$ by replacing every vertex of degree $d$ of $g$ by a clique, which is isomorph to the complete graph $k_{d}$, and each edge $(x_{i},x_{j})$ of $g$ is replaced by an edge $(u,v)$ in such a way that $uin x_{i}$, $vin x_{j}$, and two different edges of $g$ are replaced by non-adjacent edges of $g_{i}$. t...

The inflated graph GI of a graph G with n(G) vertices is obtained from G by replacing every vertex of degree d of G by a clique, which is isomorph to the complete graph Kd, and each edge (xi, xj) of G is replaced by an edge (u, v) in such a way that u ∈ Xi, v ∈ Xj , and two different edges of G are replaced by non-adjacent edges of GI . For integer k ≥ 1, the k-tuple total domination number γ ×...

background : to prepare safe and adequate blood supply to meet patients’ needs and ensure a sufficient number of regular blood donors, knowledge about factors encouraging people to donate blood regularly is essential. considering its importance, we aimed to identifying the effective factors of the return to blood donation in based on zero-inflated count regression models using bayesian approach...

The inflation $G_{I}$ of a graph $G$ with $n(G)$ vertices and $m(G)$ edges is obtained from $G$ by replacing every vertex of degree $d$ of $G$ by a clique, which is isomorph to the complete graph $K_{d}$, and each edge $(x_{i},x_{j})$ of $G$ is replaced by an edge $(u,v)$ in such a way that $uin X_{i}$, $vin X_{j}$, and two different edges of $G$ are replaced by non-adjacent edges of $G_{I}$. T...

A graph has thickness t if the edges can be decomposed into t and no fewer planar layers. We study one aspect of a generalization of Ringel’s famous Earth-Moon problem: what is the largest chromatic number of any thickness-2 graph? In particular, given a graph G we consider the r-inflation of G and find bounds on both the thickness and the chromatic number of the inflated graphs. In some instan...

aim : the aim of this study was to compare alternatives methods for analysis of zero inflated count data and compare them with simple count models that are used by researchers frequently for such zero inflated data. background : analysis of viral load and risk factors could predict likelihood of achieving sustain virological response (svr). this information is useful to protect a person from ac...

Richter and Thomassen proved that every graph has an edge e such that the crossing number crpG eq of G e is at least p2{5qcrpGq Op1q. Fox and Cs. Tóth proved that dense graphs have large sets of edges (proportional in the total number of edges) whose removal leaves a graph with crossing number proportional to the crossing number of the original graph; this result was later strenghtened by Černý...

background: the number of failed courses and semesters in students are indicatorsof their performance. these amounts have zero inflated (zi) distributions. using zi poisson and negative binomial distributions we can model these count data to find the associated factors and estimate the parameters. this study aims at to investigate the important factors related to the educational performance of ...